package datastructure.book.tujiesuanfa.queueastack.hard;

import java.util.LinkedList;

public class Solution {
    /**
     * putIn入栈序列，takeOut出栈序列，判断出栈序列是否合法
     * 栈中元素值各不相同，putIn 是 takeOut 的排列。
     * putIn = [6,7,8,9,10,11], takeOut = [9,11,10,8,7,6]
     * true
     * push(6), push(7), push(8), push(9), pop() -> 9,
     * push(10), push(11),pop() -> 11,pop() -> 10, pop() -> 8, pop() -> 7, pop() -> 6
     */
    public boolean validateBookSequences(int[] putIn, int[] takeOut) {
        return false;
    }
}
